A Motzkin filter in the Tamari lattice
نویسندگان
چکیده
The Tamari lattice of order n can be defined on the set Tn of binary trees endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we restrict our attention to the subset Mn of Motzkin trees. This set appears as a filter of the Tamari lattice. We prove that its diameter is 2n − 5 and that its radius is n − 2. Enumeration results are given for join and meet irreducible elements, minimal elements and coverings. The set Mn endowed with an order relation based on a restricted rotation is then isomorphic to a ranked join-semilattice recently defined in [2]. As a consequence, we deduce an upper bound for the rotation distance between two Motzkin trees in Tn which gives the exact value for some specific pairs of Motzkin trees.
منابع مشابه
Motzkin subposets and Motzkin geodesics in Tamari lattices
The Tamari lattice of order n can be defined by the set Dn of Dyck words endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we study this rotation on the restricted set of Motzkin words. An upper semimodular join semilattice is obtained and a shortest path metric can be defined. We compute the corresponding distance between two Motzkin word...
متن کاملOn a Subposet of the Tamari Lattice
We discuss some properties of a subposet of the Tamari lattice introduced by Pallo (1986), which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within an interval of the comb poset: rotation distance, meets and joins, and the common parse words function for a pair of trees. We relate this poset to a partial...
متن کاملChains of Maximum Length in the Tamari Lattice
The Tamari lattice Tn was originally defined on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Although in several related lattices, the number of maximal chains is known, quoting Knuth, “The enumeration of such paths in Tamari lattices remains mysterious.” The lengths of maximal chains vary over a great range. In this paper, we focu...
متن کاملTamari Lattices and the symmetric Thompson monoid
We investigate the connection between Tamari lattices and the Thompson group F , summarized in the fact that F is a group of fractions for a certain monoid F sym whose Cayley graph includes all Tamari lattices. Under this correspondence, the Tamari lattice operations are the counterparts of the least common multiple and greatest common divisor operations in F sym. As an application, we show tha...
متن کاملExtending the Tamari Lattice to Some Compositions of Species
COMPOSITIONS OF SPECIES STEFAN FORCEY Abstract. An extension of the Tamari lattice to the multiplihedra is discussed, along with projections to the composihedra and the Boolean lattice. The multiplihedra and composihedra are sequences of polytopes that arose in algebraic topology and category theory. Here we describe them in terms of the composition of combinatorial species. We de ne lattice st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 338 شماره
صفحات -
تاریخ انتشار 2015